Equitable colorings of non-uniform simple hypergraphs
نویسنده
چکیده
The paper is devoted to the combinatorial problem concerning equitable colorings of non-uniform simple hypergraphs. Let H = (V,E) be a hypergraph, a coloring with r colors of its vertex set V is called equitable if it is proper (i.e. none of the edges is monochromatic) and the cardinalities of the color classes differ by at most one. We show that if H is a simple hypergraph with minimum edge-cardinality n and ∑ e∈E r1−|e| c √ n, for some absolute constant c > 0, then H has an equitable r-coloring.
منابع مشابه
Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
The talk deals with combinatorial problems concerning colorings of non-uniform hyper-graphs. Let H = (V, E) be a hypergraph with minimum edge-cardinality n. We show that if H is a simple hypergraph (i.e. every two distinct edges have at most one common vertex) and e∈E r 1−|e| c √ n, for some absolute constant c > 0, then H is r-colorable. We also obtain a stronger result for triangle-free simpl...
متن کاملEquitable two-colorings of uniform hypergraphs
An equitable two-coloring of a hypergraph H = (V, E) is a proper vertex two-coloring such that the cardinalities of color classes differ by at most one. In connection with property B problem Radhakrishnan and Srinivasan proved that if H is a k-uniform hypergraph with maximum vertex degree ∆(H) satisfying ∆(H) c 2 k−1 √ k ln k (1) for some absolute constant c > 0, then H is 2-colorable. By using...
متن کاملExtremal problems for colorings of simple hypergraphs and applications
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any n-uniform simple hypergraph H with maximum edge degree at most Δ(H) ≤ c ·nrn−1, is r-colorable, where c > 0 is an absolute constant. As an application of our proof technique we establish a new lower bound for the Van der Waerden number W (n, r).
متن کاملColorings of hypergraphs with large number of colors
The paper deals with the well-known problem of Erdős and Hajnal concerning colorings of uniform hypergraphs and some related questions. Let m(n, r) denote the minimum possible number of edges in an n-uniform non-r-colorable hypergraph. We show that for r > n, c1 n lnn m(n, r) rn C1 n lnn, where c1, C1 > 0 are some absolute constants.
متن کاملConflict-free Colorings of Uniform Hypergraphs with Few Edges
A coloring of the vertices of a hypergraph H is called conflict-free if each edge e of H contains a vertex whose color does not repeat in e. The smallest number of colors required for such a coloring is called the conflict-free chromatic number of H, and is denoted by χCF (H). Pach and Tardos proved that for an (2r − 1)-uniform hypergraph H with m edges, χCF (H) is at most of the order of rm lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015